GATE CSE 2023
Q31.
Consider the language L over the alphabet {0, 1}, given below:L = \{w \in \{0, 1\}^* | w \text{ does not contain three or more consecutive 1's} \}. The minimum number of states in a Deterministic Finite-State Automaton (DFA) for L is _____.Q32.
Consider the IEEE-754 single precision floating point numbers P=0xC1800000 and Q=0x3F5C2EF4. Which one of the following corresponds to the product of these numbers (i.e., P x Q), represented in the IEEE-754 single precision format?Q33.
A particular number is written as 132 in radix-4 representation. The same number in radix-5 representation is _____.Q34.
Consider the given C-code and its corresponding assembly code, with a few operands U1-U4 being unknown. Some useful information as well as the semantics of each unique assembly instruction is annotated as inline comments in the code. The memory is byte-addressable.Which one of the following options is a CORRECT replacement for operands in the position (U1, U2, U3, U4) in the above assembly code?Q35.
Consider a 3-stage pipelined processor having a delay of 10 ns (nanoseconds), 20 ns, and 14 ns, for the first, second, and the third stages, respectively. Assume that there is no other delay and the processor does not suffer from any pipeline hazards. Also assume that one instruction is fetched every cycle. The total execution time for executing 100 instructions on this processor is _______ nsQ36.
Consider a random experiment where two fair coins are tossed. Let A be the event that denotes HEAD on both the throws, B be the event that denotes HEAD on the first throw, and C be the event that denotes HEAD on the second throw. Which of the following statements is/are TRUE?Q37.
Consider the two functions incr and decr shown below. incr(){ wait(s); X = X+1; signal(s); } decr(){ wait(s); X = X-1; signal(s); } There are 5 threads each invoking incr once, and 3 threads each invoking decr once, on the same shared variable X. The initial value of X is 10. Suppose there are two implementations of the semaphore s, as follows: I-1: s is a binary semaphore initialized to 1. I-2: s is a counting semaphore initialized to 2. Let V1, V2 be the values of X at the end of execution of all the threads with implementations I-1, I-2, respectively. Which one of the following choices corresponds to the minimum possible values of V1, V2, respectively?Q38.
Which of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?Q39.
The forwarding table of a router is shown below.\begin{array}{|c|c|c|c|} \hline \\ Subnet \; Number&Subnet \;Mask&Interface ID \\ \hline 200.150.0.0 &255.255.0.0& 1\\ \hline 200.150.64.0 &255.255.224.0 &2\\ \hline 200.150.68.0 &255.255.255.0 &3\\ \hline 200.150.68.64 &255.255.255.224 &4 \\ \hline Default & &0\\ \hline \end{array} A packet addressed to a destination address 200.150.68.118 arrives at the router. It will be forwarded to the interface with ID _____.Q40.
The Lucas sequence L_n is defined by the recurrence relation: L_n=L_{n-1}+L_{n-2}, \; for \; n\geq 3, with L_1=1 \; and \; L_2=3 Which one of the options given is TRUE?